The arithmetic of consecutive polynomial sequences over finite fields
نویسندگان
چکیده
Motivated by a question of van der Poorten about the existence of infinite chain of prime numbers (with respect to some base), in this paper we advance the study of sequences of consecutive polynomials whose coefficients are chosen consecutively from a sequence in a finite field of odd prime characteristic. We study the arithmetic of such sequences, including bounds for the largest degree of irreducible factors, the number of irreducible factors, as well as for the number of such sequences of fixed length in which all the polynomials are irreducible.
منابع مشابه
Efficient implementation of low time complexity and pipelined bit-parallel polynomial basis multiplier over binary finite fields
This paper presents two efficient implementations of fast and pipelined bit-parallel polynomial basis multipliers over GF (2m) by irreducible pentanomials and trinomials. The architecture of the first multiplier is based on a parallel and independent computation of powers of the polynomial variable. In the second structure only even powers of the polynomial variable are used. The par...
متن کاملA Unified View of Long-period Random Number Generators
Two types of linear congruent.ial random number generator are considered: the conventional one using integer arithmetic and another using polynomial arithmetic over finite fields. We show t.hat most of the long-period random number generators currently used or recently proposed, which include multiple re.:ursive generators, shift register generators, add-with-carry and subtract-with-borrow gene...
متن کاملArea-efficient VLSI implementation of arithmetic operations in binary finite fields GF( )
This paper presents a bit-serial architecture for efficient addition and multiplication in binary finite fields GF( ) using a polynomial basis representation. Moreover, a low-power implementation of the arithmetic circuits and the registers is proposed. The introduced multiplier operates over a wide range of binary finite fields up to an order of . It is detailed that the bit-serial multiplier ...
متن کاملArithmetic Teichmuller Theory
By Grothedieck's Anabelian conjectures, Galois representations landing in outer automorphism group of the algebraic fundamental group which are associated to hyperbolic smooth curves defined over number fields encode all arithmetic information of these curves. The goal of this paper is to develope and arithmetic teichmuller theory, by which we mean, introducing arithmetic objects summarizing th...
متن کاملLong Period Sequences Generated by the Logistic Map over Finite Fields with Control Parameter Four
Recently, binary sequences generated by chaotic maps have been widely studied. In particular, the logistic map is used as one of the chaotic map. However, if the logistic map is implemented by using finite precision computer arithmetic, rounding is required. In order to avoid rounding, Miyazaki, Araki, Uehara and Nogami proposed the logistic map over finite fields, and show some properties of s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Finite Fields and Their Applications
دوره 50 شماره
صفحات -
تاریخ انتشار 2018